Strongly almost disjoint familes, revisited
نویسندگان
چکیده
منابع مشابه
D ec 1 99 8 STRONGLY ALMOST DISJOINT FAMILES
The relations M(κ, λ, µ) → B [resp. B(σ)] meaning that if A ⊂ [κ] λ with |A| = κ is µ-almost disjoint then A has property B [resp. has a σ-transversal] had been introduced and studied under GCH in [EH]. Our two main results here say the following: Assume GCH and ̺ be any regular cardinal with a supercompact [resp. 2-huge] cardinal above ̺. Then there is a ̺-closed forcing P such that, in V P , we ...
متن کاملAlmost-disjoint Coding and Strongly Saturated Ideals
We show that Martin’s Axiom plus c = א2 implies that there is no (א2,א2,א0)-saturated σ-ideal on ω1. Given cardinals λ, κ and γ, a σ-ideal I on a set X is said to be (λ, κ, γ)-saturated if for every set {Aα : α < λ} ⊂ P(X) \ I there exists a set Y ∈ [λ] such that for all Z ∈ [Y ] , ⋂ {Aα : α ∈ Z} ∈ I. Laver [6] was the first to show the consistency of an (א2,א2,א0)-saturated ideal on ω1, using ...
متن کاملStrongly Almost Disjoint Sets and Weakly Uniform Bases
A combinatorial principle CECA is formulated and its equivalence with GCH + certain weakenings of 2λ for singular λ is proved. CECA is used to show that certain “almost point-< τ” families can be refined to point-< τ families by removing a small set from each member of the family. This theorem in turn is used to show the consistency of “every first countable T1-space with a weakly uniform base ...
متن کاملConflict Free Colorings of (strongly) Almost Disjoint Set-systems
f : ∪A → ρ is called a conflict free coloring of the set-system A (with ρ colors) if ∀A ∈ A ∃ ζ < ρ ( |A ∩ f−1{ζ}| = 1 ). The conflict free chromatic number χCF(A) of A is the smallest ρ for which A admits a conflict free coloring with ρ colors. A is a (λ, κ, μ)-system if |A| = λ, |A| = κ for all A ∈ A, and A is μ-almost disjoint, i.e. |A ∩ A′| < μ for distinct A,A′ ∈ A. Our aim here is to stud...
متن کاملA Model with No Strongly Separable Almost Disjoint Families
We answer a question of Shelah and Steprāns [6] by producing a model of ZFC where there are no strongly separable almost disjoint families. The notion of a strongly separable almost disjoint family is a natural variation on the well known notion of a completely separable almost disjoint family, and is closely related to the metrization problem for countable Fréchet groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2000
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-163-1-13-23